A Note on Convex Programming in Practical Problems
نویسندگان
چکیده
منابع مشابه
Note on Practical Dynamic Programming
Since we convert the original sequential problem into a collection of small problems, it is important to make sure that the solution to each of the small problems is actually optimal in the original problem. In other words, the optimal choice in each of the two-period problem must be globally optimal to justify the transformation. Richard Bellman, the inventor of the dynamic programming method,...
متن کاملA SHORT NOTE ON THE RELATIONSHIP BETWEEN GOAL PROGRAMMING AND FUZZY PROGRAMMING FOR VECTORMAXIMUM PROBLEMS
A theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.In this short note it is shown that the relationship does not exist underall circumstances. The necessary correction is proposed.
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملa short note on the relationship between goal programming and fuzzy programming for vectormaximum problems
a theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.in this short note it is shown that the relationship does not exist underall circumstances. the necessary correction is proposed.
متن کاملA note on central cutting plane methods for convex programming
Most cutting plane methods, like that of Kelley and Cheney and Goldstein solve a linear approximation (localization) of the problem, and then generate an additional cut to remove the linear program's optimal point. Other methods, like the \central cutting" plane methods, calculate a center of the linear approximation and then adjust the level of the objective, or separate the current center fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Society for Mathematical Services and Standards
سال: 2013
ISSN: 2277-8020
DOI: 10.18052/www.scipress.com/bsmass.5.19